-
1 unsolvability structure
Большой англо-русский и русско-английский словарь > unsolvability structure
-
2 unsolvability structure
Математика: структура неразрешимостиУниверсальный англо-русский словарь > unsolvability structure
-
3 unsolvability structure
English-Russian scientific dictionary > unsolvability structure
-
4 structure
1) конструкция; строение; структура || структурировать2) сооружение, здание; строительная конструкция3) состав4) текстура5) геол. формация•- finitely generated structure - fish protection structure - locally convex structure - recursively presentable structure - redundant logical structure - strictly finer structure - strongly undecidable structure - weakly saturated structure -
5 структура неразрешимости
Русско-английский научно-технический словарь Масловского > структура неразрешимости
-
6 структура неразрешимости
Большой англо-русский и русско-английский словарь > структура неразрешимости
-
7 структура неразрешимости
Mathematics: unsolvability structureУниверсальный русско-английский словарь > структура неразрешимости
-
8 рекурсивный
1. recursively2. recursiveРусско-английский словарь по информационным технологиям > рекурсивный
См. также в других словарях:
Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
History of logic — Philosophy ( … Wikipedia
Classification of manifolds — In mathematics, specifically geometry and topology, the classification of manifolds is a basic question, about which much is known, and many open questions remain. Contents 1 Main themes 1.1 Overview 1.2 Different categories and additional… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Universal Turing machine — This article is a supplement to the article Turing machine. Alan Turing s universal computing machine (alternately universal machine , machine U , U ) is the name given by him (1936 1937) to his model of an all purpose a machine (computing… … Wikipedia